Set theory

Results: 2815



#Item
871Mathematics / Dominating set / Unit disk graph / Independent set / APX / Approximation algorithm / Vertex cover / Planar separator theorem / Theoretical computer science / Graph theory / NP-complete problems

CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
872Spanning tree / Network theory / Shortest path problem / Minimum spanning tree / Theoretical computer science / Graph theory / Mathematics

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Spanning trees across axis-parallel segments Michael Hoffmann∗ Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:58:24
873Kirkpatrick–Seidel algorithm / Convex hull / Computational geometry / Convex set / Algorithm / Analysis of algorithms / Voronoi diagram / Computational complexity theory / Hull / Geometry / Convex hull algorithms / Mathematics

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis J´er´emy Barbay∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:05:33
874Morphisms / Group theory / Category theory / Isomorphism / Group action / Natural transformation / Ø / Groupoid / Finite set / Mathematics / Abstract algebra / Algebra

"Everything Is Everything" Revisited: Shapeshifting Data Types with Isomorphisms and Hylomorphisms

Add to Reading List

Source URL: www.complex-systems.com

Language: English - Date: 2012-06-20 13:21:03
875Graph / Horizontal coordinate system / Randomized algorithm / Connectivity / Graph coloring / Graph theory / Theoretical computer science / Mathematics

16th Canadian Conference on Computational Geometry, 2004 Computing the Set of All Distant Horizons of a Terrain Daniel Archambault William Evans

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
876Analysis of algorithms / Computational complexity theory / Time complexity / Factorial / Mathematics / Theoretical computer science / Number theory

A Practical Approach to Approximating the Diameter of Point-set in Low Dimensions Kumar Gaurav Bijay∗ Antoine Vigneron†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:45
877Applied mathematics / Theory of computation / Computability theory / Formal languages / Automata theory / Cellular automaton / Recursively enumerable set / Recursively enumerable language / Universal Turing machine / Theoretical computer science / Turing machine / Computer science

Nonrecursive Cellular Automata Invariant Sets

Add to Reading List

Source URL: www.complex-systems.com

Language: English - Date: 2013-03-26 14:30:37
878NP-complete problems / Parameterized complexity / Kernelization / Vertex cover / Graph coloring / Minimum k-cut / Algorithm / Independent set / Greedy algorithm / Theoretical computer science / Mathematics / Computational complexity theory

Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-08-06 03:09:48
879Statistical theory / Auburn Hills /  Michigan / Chrysler / Dodge / Likelihood function / Maximum likelihood / XK / Estimation theory / Statistics / Bayesian statistics

Iowa State University Department of Computer Science Machine Learning (Com S 573) Vasant Honavar Spring 2010 Problem Set 2

Add to Reading List

Source URL: www.cs.iastate.edu

Language: English - Date: 2010-02-07 17:52:45
880Combinatorial optimization / Routing algorithms / Search algorithms / Matching / Randomized algorithm / Graph coloring / Connectivity / Graph / A* search algorithm / Mathematics / Theoretical computer science / Graph theory

Chapter 7 Maximal Independent Set In this chapter we present a highlight of this course, a fast maximal independent set (MIS) algorithm. The algorithm is the first randomized algorithm that we study in this class. In di

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
UPDATE